Symbol alphabets from plabic graphs III: n = 9
نویسندگان
چکیده
A bstract Symbol alphabets of n -particle amplitudes in $$ \mathcal{N} N = 4 super-Yang-Mills theory are known to contain certain cluster variables G(4 , ) as well algebraic functions variables. In this paper we solve the C Z 0 matrix equations associated several cells totally non-negative Grassmannian, combining methods arXiv:2012.15812 for rational letters and arXiv:2007.00646 letters. We identify sets parameterizations top cell G + (5, 9) which solutions produce all (and only) variable 2-loop nine-particle NMHV amplitude, plabic graphs from its originate.
منابع مشابه
directionally n-signed graphs-iii: the notion of symmetric balance
let $g=(v, e)$ be a graph. by emph{directional labeling (ord-labeling)} of an edge $x=uv$ of $g$ by an ordered $n$-tuple$(a_1,a_2,...,a_n)$, we mean a labeling of the edge $x$ such thatwe consider the label on $uv$ as $(a_1,a_2,...,a_n)$ in thedirection from $u$ to $v$, and the label on $x$ as$(a_{n},a_{n-1},...,a_1)$ in the direction from $v$ to $u$. inthis paper, we study graphs, called emph{...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملTris{N-[(anthracen-9-yl)methyleneamino]thioureato}cobalt(III) tetrahydrate
In the title complex, [Co(C(16)H(12)N(3)S)(3)]·4H(2)O, the central Co(III) atom is in a distorted octa-hedral coordination environment. There are three N-[(anthracen-9-yl)-methyl-ene-amino]-thio-ureate ligands coordinated to the Co(III) atom via three imine N and three thio-amide S atoms. The Co-S and Co-N bond distances are in expected ranges [2.2194 (8)-2.2545 (8) and 1.926 (2)-1.985 (2)Å, re...
متن کاملOn Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least two actions, the (in)equational theory of BCCSP modulo simulation preorder or equivalence does not have a finite basis. In contrast, in the presence of an alphabet that is infinite or a singleton, the equational theo...
متن کاملN ov 1 99 9 PURELY INFINITE , SIMPLE C ∗ - ALGEBRAS ARISING FROM FREE PRODUCT CONSTRUCTIONS , III
In the reduced free product of C∗–algebras, (A, φ) = (A1, φ1) ∗ (A2, φ2) with respect to faithful states φ1 and φ2, A is purely infinite and simple if A1 is a reduced crossed product B ⋊α,r G for G an infinite group, if φ1 is well behaved with respect to this crossed product decomposition, if A2 6= C and if φ is not a trace. The reduced free product construction for C–algebras was invented inde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2021
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep09(2021)002